Letter to Pearl Von Allmen regarding SEAALL membership status, June 6, 1967

A letter from Walter Griggs, Jr. to Pearl Von Allmen asking for information regarding the SEAALL membership status of the Virginia State Law Library

Letter to Pearl Von Allmen regarding SEAALL membership status, July 24, 1967

A letter from Walter Griggs, Jr. to Pearl Von Allmen thanking Von Allmen for responding to Griggs\u27 letter regarding SEAALL membership for the Virginia State Law Library

Q2Q_2-free families in the Boolean lattice

For a family $\mathcal{F}$ of subsets of [n]=\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a P-free family of subsets of [n]. Let $Q_2$ be the poset with distinct elements a, b, c, d, a<b, c<d; i.e., the 2-dimensional Boolean lattice. We show that $2N -o(N) \leq ex(n, Q_2)\leq 2.283261N +o(N),$ where $N = \binom{n}{\lfloor n/2 \rfloor}$. We also prove that the largest $Q_2$-free family of subsets of [n] having at most three different sizes has at most 2.20711N members.Comment: 18 pages, 2 figure

A methodology for the conversion of tactical board games to computer assisted war games

As part of the development of the capabilities of the Command, Control and Communications (C3) Laboratory at the Naval Postgraduate School, there was a need for an in-house computer assisted tactical war game. The objective of this thesis was to satisfy that need. An anti-submarine warfare board game, UP SCOPE!, which was designed, developed and produced by Simulations Productions, Inc. of New York, was used as the model. This thesis provides an interactive computer assisted anti-submarine warfare war game called Up Scope which is written in FORTRAN. This thesis also develops a framework for any future computer adaptation of a tactical board game, details a players manual and gives full documentation of the computer programming. Program listings, a sample game and several tactical scenarios are also included.http://archive.org/details/methodologyforco00grigCaptain, United States Air ForceLieutenant Commander, Supply CorpsApproved for public release; distribution is unlimited

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}$. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

Empirical Analysis of Factors Affecting Confirmation Bias Levels of Software Engineers

Confirmation bias is defined as the tendency of people to seek evidence that verifies a hypothesis rather than seeking evidence to falsify it. Due to the confirmation bias, defects may be introduced in a software product during requirements analysis, design, implementation and/or testing phases. For instance, testers may exhibit confirmatory behavior in the form of a tendency to make the code run rather than employing a strategic approach to make it fail. As a result, most of the defects that have been introduced in the earlier phases of software development may be overlooked leading to an increase in software defect density. In this paper, we quantify confirmation bias levels in terms of a single derived metric. However, the main focus of this paper is the analysis of factors affecting confirmation bias levels of software engineers. Identification of these factors can guide project managers to circumvent negative effects of confirmation bias, as well as providing guidance for the recruitment and effective allocation of software engineers. In this empirical study, we observed low confirmation bias levels among participants with logical reasoning and hypothesis testing skills

Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk

It is well recognised that data mining and statistical analysis pose a serious treat to privacy. This is true for financial, medical, criminal and marketing research. Numerous techniques have been proposed to protect privacy, including restriction and data modification. Recently proposed privacy models such as differential privacy and k-anonymity received a lot of attention and for the latter there are now several improvements of the original scheme, each removing some security shortcomings of the previous one. However, the challenge lies in evaluating and comparing privacy provided by various techniques. In this paper we propose a novel entropy based security measure that can be applied to any generalisation, restriction or data modification technique. We use our measure to empirically evaluate and compare a few popular methods, namely query restriction, sampling and noise addition.Comment: 20 pages, 4 figure

Guidelines on clinical presentation and management of non-dystrophic myotonias

The non‐dystrophic myotonias (NDMs) are rare muscle hyperexcitability disorders caused by gain‐of‐function mutations in the SCN4A gene or loss‐of‐function mutations in the CLCN1 gene. Clinically, they are characterized by myotonia, defined as delayed muscle relaxation after voluntary contraction, which leads to symptoms of muscle stiffness, pain, fatigue, and weakness. Diagnosis is based on history and examination findings, the presence of electrical myotonia on electromyography (EMG), and genetic confirmation. In the absence of genetic confirmation, the diagnosis is supported by detailed electrophysiological testing, exclusion of other related disorders, and analysis of a variant of uncertain significance (VUS) if present. Symptomatic treatment with a sodium channel blocker, such as mexiletine, is usually the first step in management, as well as educating patients about potential anesthetic complications